Robustness Verification of Quantum Classifiers
نویسندگان
چکیده
Several important models of machine learning algorithms have been successfully generalized to the quantum world, with potential speedup training classical classifiers and applications data analytics in physics that can be implemented on near future computers. However, noise is a major obstacle practical implementation learning. In this work, we define formal framework for robustness verification analysis against noises. A robust bound derived an algorithm developed check whether or not respect data. particular, find adversarial examples during checking. Our approach Google's TensorFlow Quantum verify small disturbance noises, from surrounding environment. The effectiveness our confirmed by experimental results, including bits classification as "Hello World" example, phase recognition cluster excitation detection real world intractable physical problems, MNIST world.
منابع مشابه
Robustness of Multi-dimensional Bayesian Network Classifiers
Multi-dimensional Bayesian network classifiers (MDCs) generalise the popular robustly performing one-dimensional classifiers (ODCs) to application domains that require an instance to be classified into a combination of classes. In previous work we compared the sensitivity of MDC and ODC output probabilities to small parameter inaccuracies. In this paper we extend our analyses and study the robu...
متن کاملMeasuring Robustness of Classifiers to Geometric Transformations
For many classification tasks, the ideal classifier should be invariant to geometric transformations such as changing the view angle. However, this cannot be said decisively for the state-of-the-art image classifiers, such as convolutional neural networks. Mainly, this is because there is a lack of methods for measuring the transformation invariance in them, especially for transformations with ...
متن کاملRobustness of Classifiers to Changing Environments
In this paper, we test some of the most commonly used classifiers to identify which ones are the most robust to changing environments. The environment may change over time due to some contextual or definitional changes. The environment may change with location. It would be surprising if the performance of common classifiers did not degrade with these changes. The question, we address here, is w...
متن کاملSignature Verification using Integrated Classifiers
This paper presents a new approach for off-line signature verification. The proposed system is based on global, grid, ink distribution and texture features. The Boosting algorithm is applied to train and integrate multiple classifiers, and the distance-based classifier used as the base classifier corresponding to each feature set. Adaptive threshold is associated with individuality. Experimenta...
متن کاملComputer Aided Extrinsic Robustness Verification
This paper answers an industrial question: ”Given the specification of input values, is it possible to verify that the source code of a program is robust with respect to erroneous inputs and memory alterations?”. We show that such verification is possible but quite complex to perform manually and we propose a semi-automatic solution. Our work is original in two ways: a new notion of software ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-81685-8_7